Panpositionable hamiltonicity of the alternating group graphs
نویسندگان
چکیده
The alternating group graph AGn is an interconnection network topology based on the Cayley graph of the alternating group. There are some interesting results concerning the hamiltonicity and the fault tolerant hamiltonicity of the alternating group graphs. In this article, we propose a new concept called panpositionable hamiltonicity. A hamiltonian graph G is panpositionable if for any two different vertices x and y ofG and for any integer l satisfying d (x ,y ) ≤ l ≤ |V (G)| − d (x ,y ), there exists a hamiltonian cycle C of G such that the relative distance between x , y on C is l . We show that AGn is panpositionable hamiltonian if n ≥ 3. © 2007 Wiley Periodicals, Inc. NETWORKS, Vol. 50(2), 146–156 2007
منابع مشابه
Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
Jwo et al. [Networks 23 (1993) 315–326] introduced the alternating group graph as an interconnection network topology for computing systems. They showed that the proposed structure has many advantages over n-cubes and star graphs. For example, all alternating group graphs are hamiltonian-connected (i.e., every pair of vertices in the graph are connected by a hamiltonian path) and pancyclic (i.e...
متن کاملThe Panpositionable Hamiltonicity of k-ary n-cubes
The hypercube Qn is one of the most well-known and popular interconnection networks and the k-ary n-cubeQn is an enlarged family from Qn that keeps many pleasing properties from hypercubes. In this article, we study the panpositionable hamiltonicity of Qn for k ≥ 3 and n ≥ 2. Let x, y of V (Qn) be two arbitrary vertices and C be a hamiltonian cycle of Qn. We use dC(x, y) to denote the distance ...
متن کاملOn Eulerianity and Hamiltonicity in Annihilating-ideal Graphs
Let $R$ be a commutative ring with identity, and $ mathrm{A}(R) $ be the set of ideals with non-zero annihilator. The annihilating-ideal graph of $ R $ is defined as the graph $AG(R)$ with the vertex set $ mathrm{A}(R)^{*}=mathrm{A}(R)setminuslbrace 0rbrace $ and two distinct vertices $ I $ and $ J $ are adjacent if and only if $ IJ=0 $. In this paper, conditions under which $AG(R)$ is either E...
متن کاملHamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid Graphs
In 2007, Arkin et al. [3] initiated a systematic study of the complexity of the Hamiltonian cycle problem on square, triangular, or hexagonal grid graphs, restricted to polygonal, thin, superthin, degree-bounded, or solid grid graphs. They solved many combinations of these problems, proving them either polynomially solvable or NP-complete, but left three combinations open. In this paper, we pro...
متن کاملA sufficient condition for Hamiltonicity in locally finite graphs
Using topological circles in the Freudenthal compactification of a graph as infinite cycles, we extend to locally finite graphs a result of Oberly and Sumner on the Hamiltonicity of finite graphs. This answers a question of Stein, and gives a sufficient condition for Hamiltonicity in locally finite graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Networks
دوره 50 شماره
صفحات -
تاریخ انتشار 2007